Quadratically Regularized Optimal Transport on Graphs
نویسندگان
چکیده
منابع مشابه
Quadratically-Regularized Optimal Transport on Graphs
Optimal transportation provides a means of lifting distances between points on a geometric domain to distances between signals over the domain, expressed as probability distributions. On a graph, transportation problems can be used to express challenging tasks involving matching supply to demand with minimal shipment expense; in discrete language, these become minimumcost network ow problems. R...
متن کاملRegularized Discrete Optimal Transport
This article introduces a generalization of discrete Optimal Transport that includes a regularity penalty and a relaxation of the bijectivity constraint. The corresponding transport plan is solved by minimizing an energy which is a convexification of an integer optimization problem. We propose to use a proximal splitting scheme to perform the minimization on large scale imaging problems. For un...
متن کاملTsallis Regularized Optimal Transport and Ecological Inference
Optimal transport is a powerful framework for computing distances between probability dis-tributions. We unify the two main approaches to optimal transport, namely Monge-Kantorovitchand Sinkhorn-Cuturi, into what we define as Tsallis regularized optimal transport (trot).trot interpolates a rich family of distortions from Wasserstein to Kullback-Leibler, encompass-ing as well...
متن کاملDomain Adaptation with Regularized Optimal Transport
We present a new and original method to solve the domain adaptation problem using optimal transport. By searching for the best transportation plan between the probability distribution functions of a source and a target domain, a non-linear and invertible transformation of the learning samples can be estimated. Any standard machine learning method can then be applied on the transformed set, whic...
متن کاملOptimal Mass Transport on Metric Graphs
We study an optimal mass transport problem between two equal masses on a metric graph where the cost is given by the distance in the graph. To solve this problem we find a Kantorovich potential as the limit of p−Laplacian type problems in the graph where at the vertices we impose zero total flux boundary conditions. In addition, the approximation procedure allows us to find a transport density ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2018
ISSN: 1064-8275,1095-7197
DOI: 10.1137/17m1132665